Enhancement in K-mean Clustering to Analyze Software Architecture using Normalization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clustering of Data Using K-Mean Algorithm

Clustering is associate automatic learning technique geared toward grouping a collection of objects into subsets or clusters. The goal is to form clusters that are coherent internally, however well completely different from one another. In plain words, objects within the same cluster ought to be as similar as potential, whereas objects in one cluster ought to be as dissimilar as potential from ...

متن کامل

ELISA Analyzer •, a Software to Analyze and Optimize ELISA Data

ELISA data is usually handled in the MS Excel worksheets through different methods and different formulas. Accurate and precise calculations of the data is time consuming and tedious. ELISA Analyzer was developed with a user friendly interface to streamline titration and analysis of the data obtained from ELISA and improve rapid and lucid presentation of the results. The software can also hel...

متن کامل

Normalization based K means Clustering Algorithm

K-means is an effective clustering technique used to separate similar data into groups based on initial centroids of clusters. In this paper, Normalization based K-means clustering algorithm(N-K means) is proposed. Proposed N-K means clustering algorithm applies normalization prior to clustering on the available data as well as the proposed approach calculates initial centroids based on weights...

متن کامل

Comparison between Standard K-Mean Clustering and Improved K-Mean Clustering

Clustering in data mining is very important to discover distribution patterns and this importance tends to increase as the amount of data grows. It is one of the main analytical methods in data mining and its method influences its results directly. K-means is a typical clustering algorithm[3]. It mainly consists of two phases i.e. initializing random clusters and to find the nearest neighbour. ...

متن کامل

Image Retrieval using Canopy and Improved K mean Clustering

In a typical content based image retrieval (CBIR) system, target images are sorted by feature similarities with respect to the query. These methods fail to capture similarities among target images and user feedback. To overcome this problem existing methods combine relevance feedback and clustering. But clustering requires more number of expensive distance calculations. To remedy this problem w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2015

ISSN: 0975-8887

DOI: 10.5120/21230-3973